Recruitment Market Trend Analysis with Sequential Latent Variable Models

Recruitment market analysis provides valuable understanding of industry-specific economic growth and plays an important role for both employers and job seekers. With the rapid development of online recruitment services, massive recruitment data have been accumulated and enable a new paradigm for recruitment market analysis. However, traditional methods for recruitment market analysis largely rely on the knowledge of domain experts and classic statistical models, which are usually too general to model large-scale dynamic recruitment data, and have difficulties to capture the fine-grained market trends. To this end, in this paper, we propose a new research paradigm for recruitment market analysis by leveraging unsupervised learning techniques for automatically discovering recruitment market trends based on large-scale recruitment data. Specifically, we develop a novel sequential latent variable model, named MTLVM, which is designed for capturing the sequential dependencies of corporate recruitment states and is able to automatically learn the latent recruitment topics within a Bayesian generative framework. In particular, to capture the variability of recruitment topics over time, we design hierarchical dirichlet processes for MTLVM. These processes allow to dynamically generate the evolving recruitment topics. Finally, we implement a prototype system to empirically evaluate our approach based on real-world recruitment data in China. Indeed, by visualizing the results from MTLVM, we can successfully reveal many interesting findings, such as the popularity of LBS related jobs reached the peak in the 2nd half of 2014, and decreased in 2015.Comment: 11 pages, 30 figure, SIGKDD 201

Theory of Dicke narrowing in coherent population trapping

The Doppler effect is one of the dominant broadening mechanisms in thermal vapor spectroscopy. For two-photon transitions one would naively expect the Doppler effect to cause a residual broadening, proportional to the wave-vector difference. In coherent population trapping (CPT), which is a narrow-band phenomenon, such broadening was not observed experimentally. This has been commonly attributed to frequent velocity-changing collisions, known to narrow Doppler-broadened one-photon absorption lines (Dicke narrowing). Here we show theoretically that such a narrowing mechanism indeed exists for CPT resonances. The narrowing factor is the ratio between the atom's mean free path and the wavelength associated with the wave-vector difference of the two radiation fields. A possible experiment to verify the theory is suggested.Comment: 6 pages, 2 figures; Introduction revise

Simple Realization Of The Fredkin Gate Using A Series Of Two-body Operators

The Fredkin three-bit gate is universal for computational logic, and is reversible. Classically, it is impossible to do universal computation using reversible two-bit gates only. Here we construct the Fredkin gate using a combination of six two-body reversible (quantum) operators.Comment: Revtex 3.0, 7 pages, 3 figures appended at the end, please refer to the comment lines at the beginning of the manuscript for reasons of replacemen

The quantum speed up as advanced knowledge of the solution

With reference to a search in a database of size N, Grover states: "What is the reason that one would expect that a quantum mechanical scheme could accomplish the search in O(square root of N) steps? It would be insightful to have a simple two line argument for this without having to describe the details of the search algorithm". The answer provided in this work is: "because any quantum algorithm takes the time taken by a classical algorithm that knows in advance 50% of the information that specifies the solution of the problem". This empirical fact, unnoticed so far, holds for both quadratic and exponential speed ups and is theoretically justified in three steps: (i) once the physical representation is extended to the production of the problem on the part of the oracle and to the final measurement of the computer register, quantum computation is reduction on the solution of the problem under a relation representing problem-solution interdependence, (ii) the speed up is explained by a simple consideration of time symmetry, it is the gain of information about the solution due to backdating, to before running the algorithm, a time-symmetric part of the reduction on the solution; this advanced knowledge of the solution reduces the size of the solution space to be explored by the algorithm, (iii) if I is the information acquired by measuring the content of the computer register at the end of the algorithm, the quantum algorithm takes the time taken by a classical algorithm that knows in advance 50% of I, which brings us to the initial statement.Comment: 23 pages, to be published in IJT

Quantum computation and the physical computation level of biological information processing

On the basis of introspective analysis, we establish a crucial requirement for the physical computation basis of consciousness: it should allow processing a significant amount of information together at the same time. Classical computation does not satisfy the requirement. At the fundamental physical level, it is a network of two body interactions, each the input-output transformation of a universal Boolean gate. Thus, it cannot process together at the same time more than the three bit input of this gate - many such gates in parallel do not count since the information is not processed together. Quantum computation satisfies the requirement. At the light of our recent explanation of the speed up, quantum measurement of the solution of the problem is analogous to a many body interaction between the parts of a perfect classical machine, whose mechanical constraints represent the problem to be solved. The many body interaction satisfies all the constraints together at the same time, producing the solution in one shot. This shades light on the physical computation level of the theories that place consciousness in quantum measurement and explains how informations coming from disparate sensorial channels come together in the unity of subjective experience. The fact that the fundamental mechanism of consciousness is the same of the quantum speed up, gives quantum consciousness a potentially enormous evolutionary advantage.Comment: 13 page

Is Turing's Thesis the Consequence of a More General Physical Principle?

We discuss historical attempts to formulate a physical hypothesis from which Turing's thesis may be derived, and also discuss some related attempts to establish the computability of mathematical models in physics. We show that these attempts are all related to a single, unified hypothesis.Comment: 10 pages, 0 figures; section 1 revised, other minor change

Magnetic resonance in the antiferromagnetic and normal state of NH_3K_3C_60

We report on the magnetic resonance of NH_3K_3C_60 powders in the frequency range of 9 to 225 GHz. The observation of an antiferromagnetic resonance below the phase transition at 40 K is evidence for an antiferromagnetically ordered ground state. In the normal state, above 40 K, the temperature dependence of the spin-susceptibilty measured by ESR agrees with previous static measurements and is too weak to be explained by interacting localized spins in an insulator. The magnetic resonance line width has an unusual magnetic-field dependence which is large and temperature independent in the magnetically ordered state and decreases rapidly above the transition. These observations agree with the suggestion that NH_3K_3C_60 is a metal in the normal state and undergoes a Mott-Hubbard metal to insulator transition at 40 K.Comment: 4 pages, 5 figures. Submitted to Phys. Rev.

ROM-based quantum computation: Experimental explorations using Nuclear Magnetic Resonance, and future prospects

ROM-based quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less ``magical'', and being more suited to implementing space-efficient computation (i.e. computation using the minimum number of writable qubits). Here we consider a number of small (one and two-qubit) quantum algorithms illustrating different aspects of ROM-based QC. They are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a one-qubit binary multiplication algorithm; (c) a two-qubit controlled binary multiplication algorithm; and (d) a two-qubit ROM-based version of the Deutsch-Jozsa algorithm. For each algorithm we present experimental verification using NMR ensemble QC. The average fidelities for the implementation were in the ranges 0.9 - 0.97 for the one-qubit algorithms, and 0.84 - 0.94 for the two-qubit algorithms. We conclude with a discussion of future prospects for ROM-based quantum computation. We propose a four-qubit algorithm, using Grover's iterate, for solving a miniature ``real-world'' problem relating to the lengths of paths in a network.Comment: 11 pages, 5 figure